منابع مشابه
Complexity Results for Model Checking
The complexity of model checking branching and linear time temporal logics over Kripke structures has been addressed in e.g. [SC85, CES86]. In terms of the size of the Kripke model and the length of the formula, they show that the model checking problem is solvable in polynomial time for CTL and NP-complete for L(F ). The model checking problem can be generalised by allowing more succinct descr...
متن کاملParameterized Complexity Results for Symbolic Model Checking of Temporal Logics
Reasoning about temporal knowledge is a fundamental task in the area of artificial intelligence and knowledge representation. A key problem in this area is model checking, and indispensable for the state-of-the-art in solving this problem in large-scale settings is the technique of bounded model checking. We investigate the theoretical possibilities of this technique using parameterized complex...
متن کاملComplexity Results on Branching-Time Pushdown Model Checking
The model checking problem of pushdown systems (PMC problem, for short) against standard branching temporal logics has been intensively studied in the literature. In particular, for the modal μcalculus, the most powerful branching temporal logic used for verification, the problem is known to be Exptime-complete (even for a fixed formula). The problem remains Exptime-complete also for the logic ...
متن کاملComplexity Results for Checking Equivalence of Stratified Logic Programs
Recent research in nonmonotonic logic programming under the answer-set semantics focuses on different notions of program equivalence. However, previous results do not address the important classes of stratified programs and its subclass of acyclic (i.e., recursion-free) programs, although they are recognized as important tools for knowledge representation and reasoning. In this paper, we consid...
متن کاملOn the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
We analyse the complexity of standard and weak model checking for propositional default logic; in particular, we solve the open problem of complexity in case of normal default theories and introduce a new ample class of default theories with a tractable model checking problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1995
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v2i18.19920